翻訳と辞書
Words near each other
・ Highland (automobile)
・ Highland (band)
・ Highland (Capital MetroRail station)
・ Highland (council area)
・ Highland (disambiguation)
・ Highland (Irish)
・ Highland (MBTA station)
・ Highland (PAT station)
・ Higher-dimensional algebra
・ Higher-dimensional Einstein gravity
・ Higher-dimensional gamma matrices
・ Higher-dimensional supergravity
・ Higher-order abstract syntax
・ Higher-Order and Symbolic Computation
・ Higher-order compact finite difference scheme
Higher-order differential cryptanalysis
・ Higher-order factor analysis
・ Higher-order function
・ Higher-order logic
・ Higher-order modulation
・ Higher-Order Perl
・ Higher-order programming
・ Higher-order singular value decomposition
・ Higher-order sinusoidal input describing function
・ Higher-order statistics
・ Higher-order theories of consciousness
・ Higher-order thinking
・ Higher-order volition
・ Higher-speed rail
・ Highercliff


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Higher-order differential cryptanalysis : ウィキペディア英語版
Higher-order differential cryptanalysis
In cryptography, higher-order differential cryptanalysis is a generalization of differential cryptanalysis, an attack used against block ciphers. While in standard differential cryptanalysis the difference between only two texts is used, higher-order differential cryptanalysis studies the propagation of a set of differences between a larger set of texts. Xuejia Lai, in 1994, laid the groundwork by showing that differentials are a special case of the more general case of higher order derivates. Lars Knudsen, in the same year, was able to show how the concept of higher order derivatives can be used to mount attacks on block ciphers. These attacks can be superior to standard differential cryptanalysis. Higher-order differential cryptanalysis has notably been used to break the KN-Cipher, a cipher which had previously been proved to be immune against standard differential cryptanalysis.
==Higher-order derivatives==

A block cipher which maps n-bit strings to n-bit strings can, for a fixed key, be thought of as a function f:\mathbb^n_2\to\mathbb^n_2. In standard differential cryptanalysis, one is interested in finding a pair of an input difference \alpha and an output difference \beta such that two input texts with difference \alpha are likely to result in output texts with a difference \beta i.e., that f(m\oplus\alpha)\oplus f(m) = \beta is true for many m\in\mathbb^n_2. Note that the difference used here is the XOR which is the usual case, though other definitions of difference are possible.
This motivates defining the derivative of a function f:\mathbb^n_2\to\mathbb^n_2 at a point \alpha as〔
\Delta_\alpha f(x) := f(x\oplus\alpha)\oplus f(x).

Using this definition, the i-th derivative at (\alpha_1,\alpha_2,\dots,\alpha_i) can recursively be defined as〔
\Delta^_ f(x) := \Delta_\left(\Delta^__ f(x) = f(x)\oplus f(x\oplus\alpha_1)\oplus f(x\oplus\alpha_2)\oplus f(x\oplus\alpha_1\oplus\alpha_2).
Higher order derivatives as defined here have many properties in common with ordinary derivative such as the sum rule and the product rule. Importantly also, taking the derivative reduces the algebraic degree of the function.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Higher-order differential cryptanalysis」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.